Range and Set Abstraction using SAT
نویسندگان
چکیده
Symbolic decision trees are not the only way to correlate the relationship between flags and numeric variables. Boolean formulae can also represent such relationships where the integer variables are modelled with bit-vectors of propositional variables. Boolean formula can be composed to express the semantics of a block and program state, but they are hardly tractable, hence the need to compute their abstractions. This paper shows how incremental SAT can be applied to derive range and set abstractions for bit-vectors that are constrained by Boolean formulae.
منابع مشابه
Hydrogen Abstraction Reaction of Hydroxyl Radical with 1,1-Dibromoethane and 1,2-Dibromoethane Studied by Using Semi-Classical Transition State Theory
The hydrogen abstraction reaction by OH radical from CH2BrCH2Br (R1) and CH₃CHBr2 (R2) is investigated theoretically by semi-classical transition state theory. The stationary points for both reactions are located by using ωB97X-D and KMLYP density functional methods along with cc-pVTZ basis. Single-point energy calculations are performed at the QCISD(T) and CCSD(T) levels of theory with differe...
متن کاملSAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques
ion-Refinement 1. Generate an initial abstraction function h. 2. Build abstract machine M̂ based on h. Model check M̂ . If M̂ |= φ, then M |= φ. Return TRUE. 3. If M̂ 6|= φ, check the counterexample on the concrete model. If the counterexample is real, M 6|= φ. Return FALSE. 4. Refine h, and go to step 2. SAT based Abstraction-Refinement using ILP and Machine Learning Techniques 13 Abstraction Func...
متن کاملAb Initio Theoretical Studies on the Kinetics of the Hydrogen Abstraction Reaction of Hydroxyl Radical with CH3CH2OCF2CHF2 (HFE-374pc2)
The hydrogen abstraction reaction of OH radical with CH3CH2OCF2CHF2 (HFE-374pc2) is investigated theoretically by semi-classical transition state theory. The stationary points on the potential energy surface of the reaction are located by using KMLYP density functional method along with 6-311++G(d,p) basis set. Vibrational anharmonicity coefficients, ...
متن کاملSAT based Abstraction Refinement for Hardware Verification
Model checking is a widely used automatic formal verification technique. Despite the recent advances in model checking technology, its application is still limited by the state explosion problem. For model checking large real world systems, abstraction is essential. This thesis investigates abstraction techniques for the efficient verification of hardware designs with thousands of registers. A ...
متن کاملCombining Abstraction Refinement and SAT-Based Model Checking
Unbounded model checking methods based on Boolean satisfiability (SAT) solvers are proving to be a viable alternative to BDD-based model checking. These methods include, for example, interpolation based and sequential ATPG-based approaches. In this paper, we explore the implications of using abstraction refinement in conjunction with interpolation-based model checking. Based on experiments usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 267 شماره
صفحات -
تاریخ انتشار 2010